Choosability and paintability of the lexicographic product of graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lexicographic Product of Extendable Graphs

Lexicographic product G◦H of two graphs G and H has vertex set V (G)×V (H) and two vertices (u1, v1) and (u2, v2) are adjacent whenever u1u2 ∈ E(G), or u1 = u2 and v1v2 ∈ E(H). If every matching of G of size k can be extended to a perfect matching in G, then G is called k-extendable. In this paper, we study matching extendability in lexicographic product of graphs. The main result is that the l...

متن کامل

Identifying Codes of Lexicographic Product of Graphs

Let G be a connected graph and H be an arbitrary graph. In this paper, we study the identifying codes of the lexicographic product G[H] of G and H. We first introduce two parameters of H, which are closely related to identifying codes of H. Then we provide the sufficient and necessary condition for G[H] to be identifiable. Finally, if G[H] is identifiable, we determine the minimum cardinality o...

متن کامل

Connectivity of lexicographic product and direct product of graphs

In this paper, we prove that the connectivity and the edge connectivity of the lexicographic product of two graphs G1 and G2 are equal to κ1v2 and min{λ1v 2 2 , δ2 +δ1v2}, respectively, where δi, κi, λi and vi denote the minimum degree, the connectivity, the edge-connectivity and the number of vertices of Gi, respectively. We also obtain that the edge-connectivity of the direct product of K2 an...

متن کامل

Nonrepetitive colorings of lexicographic product of graphs

A coloring c of the vertices of a graph G is nonrepetitive if there exists no path v1v2 . . . v2l for which c(vi) = c(vl+i) for all 1 ≤ i ≤ l. Given graphs G and H with |V (H)| = k, the lexicographic product G[H ] is the graph obtained by substituting every vertex of G by a copy of H , and every edge of G by a copy of Kk,k. We prove that for a sufficiently long path P , a nonrepetitive coloring...

متن کامل

construction and validation of the translation teacher competency test and the scale of students’ perceptions of translation teachers

the major purpose of this study was to develop the translation teacher competency test (ttct) and examine its construct and predictive validity. the present study was conducted in two phases: a qualitative phase as well as a quantitative phase. in the first phase of the study, the author attempted to find out the major areas of competency required for an academic translation teacher. the second...

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2017

ISSN: 0166-218X

DOI: 10.1016/j.dam.2017.02.008